Tighter Layouts of the Cube-Connected Cycles
نویسندگان
چکیده
ÐPreparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we aunfoldo the cycles in the CCC, the resulting structure can be laid out in optimal area. Index TermsÐInterconnection networks, cube-connected cycles, VLSI, embedding, routing, layout.
منابع مشابه
Efficient VLSI Layouts of Hypercubic Networks
In this paper, we present efficient VLSI layouts of several hypercubic networks. We show that an N-node hypercube and an N-node cube-connected cycles (CCC) graph can be laid out in 4N2=9 + o(N2) and 4N2=(9log22 N) + o(N2= log2 N) areas, respectively, both of which are optimal within a factor of 1:7̄+ o(1). We introduce the multilayer grid model, and present efficient layouts of hypercubes that u...
متن کاملMultilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...
متن کاملVLSI/WSI Designs for Folded Cube-Connected Cycles Architectures
This paper presents VLSI/WSI designs for a recently introduced parallel architecture known as the folded cube-connected cycles ( F C C C ) . We first discuss two layouts for the FCCC, in which there is no component redundancy. Then we incorporate redundancy, and present locally and globally reconfigurable FCCCs. We also discuss the design of universal building blocks for the construction of fau...
متن کاملLayout of the Cube-connected Cycles without Long Wires
Preparata and Vuillemin proposed the cube connected cycles CCC in and in the same paper gave an asymptotically optimal layout scheme for the CCC While all the known optimal layouts including the Preparata Vuillemin layout of the CCC have long wires we give a new layout scheme which has no long wires while keeping the asymptotically optimal area Hence we can conclude that the CCC can be laid out...
متن کاملVLSI Structures for Viterbi Receivers: Part I-General Theory and Applications
A taxonomy of VLSI grid model layouts is presented for the implementation of certain types of digital communication receivers based on the Viterbi algorithm. We deal principally with networks of many simple processors connected to perform the Viterbi algorithm in a highly parallel way. Two interconnection patterns of interest are he “shuffleexchange” and the “cube-connected cycles.” The results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 11 شماره
صفحات -
تاریخ انتشار 2000